全文获取类型
收费全文 | 11202篇 |
免费 | 770篇 |
国内免费 | 445篇 |
专业分类
化学 | 2151篇 |
晶体学 | 59篇 |
力学 | 1249篇 |
综合类 | 146篇 |
数学 | 6849篇 |
物理学 | 1963篇 |
出版年
2024年 | 15篇 |
2023年 | 155篇 |
2022年 | 234篇 |
2021年 | 378篇 |
2020年 | 260篇 |
2019年 | 262篇 |
2018年 | 288篇 |
2017年 | 374篇 |
2016年 | 360篇 |
2015年 | 269篇 |
2014年 | 542篇 |
2013年 | 653篇 |
2012年 | 708篇 |
2011年 | 628篇 |
2010年 | 522篇 |
2009年 | 655篇 |
2008年 | 655篇 |
2007年 | 697篇 |
2006年 | 565篇 |
2005年 | 470篇 |
2004年 | 379篇 |
2003年 | 345篇 |
2002年 | 318篇 |
2001年 | 291篇 |
2000年 | 288篇 |
1999年 | 224篇 |
1998年 | 248篇 |
1997年 | 223篇 |
1996年 | 151篇 |
1995年 | 179篇 |
1994年 | 143篇 |
1993年 | 134篇 |
1992年 | 114篇 |
1991年 | 87篇 |
1990年 | 81篇 |
1989年 | 67篇 |
1988年 | 54篇 |
1987年 | 43篇 |
1986年 | 44篇 |
1985年 | 56篇 |
1984年 | 51篇 |
1983年 | 15篇 |
1982年 | 24篇 |
1981年 | 22篇 |
1980年 | 19篇 |
1979年 | 38篇 |
1978年 | 20篇 |
1977年 | 31篇 |
1976年 | 18篇 |
1974年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 563 毫秒
141.
时贞军 《数学物理学报(A辑)》2004,4(6):675-682
该文提出一种无约束优化非线性共轭梯度法,证明了精确线性 搜索下的全局收敛性。当目标函数为一致凸函数时,证明了算法具有线性收敛速度。数值实验表明算法对于求解实际问题是有效的。 相似文献
142.
143.
本文通过模拟研究,讨论了最大似然方法和Bayes方法在分析结构方程模型中的相似点和不同之处。 相似文献
144.
利用集值映射切导数与半可微概念,给出了无约束与具约束的集值向量优化问题局部真有效解与局部强有效解的最优性条件。 相似文献
145.
InAs/GaSb/AlSb resonant tunneling spin device concepts 总被引:1,自引:0,他引:1
David Z. -Y. Ting Xavier Cartoix 《Physica E: Low-dimensional Systems and Nanostructures》2004,20(3-4):350
We discuss device concepts for creating spin-polarized current sources without external magnetic fields, using non-magnetic 6.1 Å semiconductor resonant tunneling structures. Spin filters, spin pumps, and spin transistors that exploit structural and bulk inversion asymmetries will be examined. 相似文献
146.
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see
[Polyak in Math Program 54:177–222, 1992; Polyak in Math Program Ser A 92:197–235, 2002; Polyak and Teboulle in Math Program
76:265–284, 1997] and references therein). The formulation of the linear SVM based on the NR method leads to an algorithm
which reduces the number of support vectors without compromising the classification performance compared to the linear soft-margin
SVM formulation. The NR algorithm computes both the primal and the dual approximation at each step. The dual variables associated
with the given data-set provide important information about each data point and play the key role in selecting the set of
support vectors. Experimental results on ten benchmark classification problems show that the NR formulation is feasible. The
quality of discrimination, in most instances, is comparable to the linear soft-margin SVM while the number of support vectors
in several instances were substantially reduced. 相似文献
147.
148.
J. Haslinger T. Kozubek K. Kunisch G. Peichl 《Journal of Mathematical Analysis and Applications》2004,290(2):665-685
This contribution combines a shape optimization approach to free boundary value problems of Bernoulli type with an embedding domain technique. A theoretical framework is developed which allows to prove continuous dependence of the primal and dual variables in the resulting saddle point problems with respect to the domain. This ensures the existence of a solution of a related shape optimization problem in a sufficiently large class of admissible domains. 相似文献
149.
Grundel D. A. Oliveira C. A. S. Pardalos P. M. 《Journal of Optimization Theory and Applications》2004,122(3):487-500
The multidimensional assignment problem (MAP) is a NP-hard combinatorial optimization problem, occurring in many applications, such as data association. In this paper, we prove two conjectures made in Ref. 1 and based on data from computational experiments on MAPs. We show that the mean optimal objective function cost of random instances of the MAP goes to zero as the problem size increases, when assignment costs are independent exponentially or uniformly distributed random variables. We prove also that the mean optimal solution goes to negative infinity when assignment costs are independent normally distributed random variables. 相似文献
150.
Currently, most combinatorial optimisation problems have to be solved, if the optimum solution is sought, using general techniques
to explore the space of feasible solutions and, more specifically, through exploratory enumerative procedures in trees and
search graphs. We propose Branch and Win, a general formulation for understanding and synthesising the different tree search
procedures that have been presented in the literature of operations research as well as in that of artificial intelligence.
Several general ideas are also presented, whose application allows designing new hybrid search algorithms, in order to implement
the procedure. 相似文献